Generating Minimal Valid Inequalities
نویسندگان
چکیده
We consider the problem of generating a lattice-free convex set to find a valid inequality that minimizes the sum of its coefficients for 2-row simplex cuts. Multi-row simplex cuts has been receiving considerable attention recently and we show that a pseudo-polytime generation of a lattice-free convex set is possible. We conclude with a short numerical study.
منابع مشابه
MILP models and valid inequalities for the two-machine permutation flowshop scheduling problem with minimal time lags
In this paper, we consider the problem of scheduling on two-machine permutation flowshop with minimal time lags between consecutive operations of each job. The aim is to find a feasible schedule that minimizes the total tardiness. This problem is known to be NP-hard in the strong sense. We propose two mixed-integer linear programming (MILP) models and two types of valid inequalities which aim t...
متن کاملOn sublinear inequalities for mixed integer conic programs
This paper studies K-sublinear inequalities, a class of inequalities with strong relations to K-minimal inequalities for disjunctive conic sets. We establish a stronger result on the sufficiency of K-sublinear inequalities. That is, we show that when K is the nonnegative orthant or the second-order cone, K-sublinear inequalities together with the original conic constraint are always sufficient ...
متن کاملCut-Generating Functions and S-Free Sets
We consider the separation problem for sets X that are inverse images of a given set S by a linear mapping. Classical examples occur in integer programming, complementarity problems and other optimization problems. One would like to generate valid inequalities that cut off some point not lying in X , without reference to the linear mapping. Formulas for such inequalities can be obtained through...
متن کاملOn Minimal Valid Inequalities for Mixed Integer Conic Programs
We study mixed integer conic sets involving a general regular (closed, convex, full dimensional, and pointed) cone K such as the nonnegative orthant, the Lorentz cone or the positive semidefinite cone. In a unified framework, we introduce K-minimal inequalities and show that under mild assumptions, these inequalities together with the trivial cone-implied inequalities are sufficient to describe...
متن کاملCut-Generating Functions
In optimization problems such as integer programs or their relaxations, one encounters feasible regions of the form {x ∈ R+ : Rx ∈ S} where R is a general real matrix and S ⊂ R is a specific closed set with 0 / ∈ S. For example, in a relaxation of integer programs introduced in [ALWW2007], S is of the form Z − b where b 6∈ Z . One would like to generate valid inequalities that cut off the infea...
متن کامل